Erik Demaine Scribe : Eric Price 1 Overview
نویسنده
چکیده
• Comparison sort: O(n lg n) • Counting sort: O(n + u) = O(n + 2w) (= O(n) for w = lg n) • Radix sort: O(n · w lg n) (= O(n) for w = O(lg n)) • van Emde Boas: O(n lg w). For w = lg n, this is O(n lg lg n). This can be improved to O(n lg w lg n), making it better than the previous methods (Kirkpatrick and Reisch [7]). • Signature sort: O(n) for w = Ω(lg n). Combined with the previous result for small w, this gives sorting in O(n lg lg n) time for all word sizes. See Andersson, Hagerup, Nilsson, and Raman [2].
منابع مشابه
Lower Bounds : Fun With Hardness Proofs Fall 2014 Lecture 11 Scribe Notes
Recall that one of the most commonly used reductions is the L-reduction, introduced by Papadim itriou and Yannakakis in [?]. This reduction consists of a pair of polynomial mappings (f(.), g(.)) where f maps an instance x of the problem A we are reducing from to an instance x/ of the problem B we are reducing to, and g maps a feasible solution y/ (of x/ i.e. instance of B) to a feasible soluti...
متن کاملAlgorithmic Lower Bounds : Fun With Hardness Proofs Fall 2014 Lecture 3 Scribe Notes
Last time, we established the hardness of two fundamental problems, (2-)Partition and 3-Partition, and exhibited a bunch of reductions from those problems to other numerical and geometrical ones. Today, we continue with reductions from 3and 2-Partition to geometrical problems—we’ll also use the fact that the problem of packing n squares into a square without rotations is strongly NP-complete, a...
متن کاملErik Demaine Scribe : Siddhartha Sen 1
In the last lecture, we analyzed the Move-To-Front heuristic for searching in a self-organizing linkedlist. In particular, we showed that Move-To-Front is both statically and dynamically optimal (as good as any dynamic list) up to a factor of 2, provided we work under Sleator & Tarjan’s cost model. We also introduced an omniscient algorithm called Order-By-Next-Request [Mun00], and proved that ...
متن کاملA Pseudopolynomial Algorithm for Alexandrov's Theorem
Alexandrov’s Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of some convex polyhedron. Recent work by Bobenko and Izmestiev describes a differential equation whose solution is the polyhedron corresponding to a given metric. We describe an algorithm based on this differential equation to compute the pol...
متن کاملA Locked Orthogonal Tree
We give a counterexample to a conjecture of Poon [Poo06] that any orthogonal tree in two dimensions can always be flattened by a continuous motion that preserves edge lengths and avoids self-intersection. We show our example is locked by extending results on strongly locked self-touching linkages due to Connelly, Demaine and Rote [CDR02] to allow zero-length edges as defined in [ADG07], which m...
متن کامل